Two Permutation Classes related to the Bubble Sort Operator
نویسندگان
چکیده
We introduce the Dual Bubble Sort operator B̂ (a sorting algorithm such that, if σ = α 1β is a permutation, then B̂(σ) = 1α B̂(β)) and consider the set of permutations sorted by the composition B̂B, where B is the classical Bubble Sort operator. We show that this set is a permutation class and we determine the generating function of the descent and fixed point distributions over this class. Afterwards, we characterize the same distributions over the set of permutations that are sorted by both B̂2 and B2.
منابع مشابه
Sorting and preimages of pattern classes
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are completely sorted when passed twice through a stack, in terms of patterns. We also solve the long-standing problem of describing West-3-stack-sortabl...
متن کاملRevstack Sort, Zigzag Patterns, Descent Polynomials of $t$-revstack Sortable Permutations, and Steingrímsson's Sorting Conjecture
In this paper we examine the sorting operator T (LnR) = T (R)T (L)n. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise t-revstack sortability in terms of patterns in a permutation that we call zigzag patterns. Using these theorems we characterise those permutations of length n which are sorted by t appl...
متن کاملOn the Inverse Image of Pattern Classes under Bubble Sort
Let B be the operation of re-ordering a sequence by one pass of bubble sort. We completely answer the question of when the inverse image of a principal pattern class under B is a pattern class.
متن کاملOperators of Equivalent Sorting Power and Related Wilf-equivalences
We study sorting operators A on permutations that are obtained composing Knuth’s stack sorting operator S and the reversal operator R, as many times as desired. For any such operator A, we provide a size-preserving bijection between the set of permutations sorted by S ◦ A and the set of those sorted by S ◦ R ◦ A, proving that these sets are enumerated by the same sequence, but also that many cl...
متن کاملAnalysis and Determination of Asymptotic Behavior Range For Popular Sorting Algorithms
Theories of Computer Sciences & Engineering nowadays are being only read than being designed and practiced. Hence in this paper and [8] we have featured the theories and practices relying beneath popular sorting algorithms and their performance measurement in our experiments for the realization of efficiency class. Further we have concentrated on finding the Asymptotic Behavior Range for the tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012